The Homotopy of Topological Graphs Based on Khalimsky Arcs
نویسندگان
چکیده
In this paper, we aim to develop a suitable homotopy theory of finite topological graphs by Khalimsky arcs. The notions developed are considered for the investigation of the algebraic invariants of topological graphs for their topological and graphical classifications. Keywords—Connected ordered topological spaces, digital topology, homotopy, Khalimsky spaces, topological graphs.
منابع مشابه
KD-(k0, k1)-HOMOTOPY EQUIVALENCE AND ITS APPLICATIONS
Let Zn be the Cartesian product of the set of integers Z and let (Z, T ) and (Zn, T n) be the Khalimsky line topology on Z and the Khalimsky product topology on Zn, respectively. Then for a set X ⊂ Zn, consider the subspace (X, T n X) induced from (Zn, T n). Considering a k-adjacency on (X, T n X), we call it a (computer topological) space with k-adjacency and use the notation (X, k, T n X) := ...
متن کاملContractibility and fixed point property: the case of Khalimsky topological spaces
*Correspondence: [email protected] Institute of Pure and Applied Mathematics, Department of Mathematics Education, Chonbuk National University, Jeonju-City, Jeonbuk 54896, Republic of Korea Abstract Based on the notions of both contractibility and local contractibility, many works were done in fixed point theory. The present paper concerns a relation between digital contractibility and the exist...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملClassification of graphs based on homotopy equivalence. Homotopy equivalent graphs. Basic graphs and complexity of homotopy equivalence classes of graphs
The main concept of this classification is that graphs belonging to the same equivalence class have similar topological properties. Graphs are called homotopy equivalent if one of them can be converted to the other one by contractible transformations. A basic representative and complexity of a homotopy equivalence class are defined and investigated. Finding a basic representative within a homot...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کامل